Parallelizing the Dual Simplex Method Parallelizing the Dual Simplex Method
نویسندگان
چکیده
We study the parallelization of the steepest-edge version of the dual simplex algorithm. Three different parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on different parallel platforms, including heterogeneous workstation clusters, Sun S20-502, Silicon Graphics multi-processors, and an IBM SP2. We report on our computational experience.
منابع مشابه
Parallelizing the Dual Simplex Method
We study the parallelization of the steepest-edge version of the dual sim-plex algorithm. Three diierent parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on ...
متن کاملSome new results on semi fully fuzzy linear programming problems
There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...
متن کاملParallelizing the dual revised simplex method
This paper introduces the design and implementation of two parallel dual simplex solvers for general large scale sparse linear programming problems. One approach, called PAMI, extends a relatively unknown pivoting strategy called suboptimization and exploits parallelism across multiple iterations. The other, called SIP, exploits purely single iteration parallelism by overlapping computational c...
متن کاملDetermination of right/left return to scale in two-stage processes based on dual simplex
As a non-parametric method of relative efficient measurement of a group of decision-making units (〖DMU〗_s), Data Envelopment Analysis (DEA) is one of the most important tools in efficiency computation. One of the main concerns dealt with in DEA is dealing with return to scale in two-stage processes in which, produced outputs of the first stage inputs are used as inputs for the second stage. The...
متن کاملSparse Implementation of Revised Simplex Algorithmson
Parallelizing sparse simplex algorithms is one of the most challenging problems. Because of very sparse matrices and very heavy communication, the ratio of computation to communication is extremely low. It becomes necessary to carefully select parallel algorithms , partitioning patterns, and communication optimization to achieve a speedup. Two implementations on Intel hypercubes are presented i...
متن کامل